Experimental Comparison of Shortest Path Approaches for Timetable Information

Using Multi-level Graphs for Timetable Information in Railway Systems

In many fields of application, shortest path finding problems in very large graphs arise. Scenarios where large numbers of on-line queries for shortest paths have to be processed in real-time appear for example in traffic information systems. In such systems, the techniques considered to speed up the shortest path computation are usually based on precomputed information. One approach proposed o...

ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

Timetable information and shortest paths

Maintenance of Multi-level Overlay Graphs for Timetable Queries

In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s algorithm. Due to the continuously growing size of real-world graphs, there is a constant need for faster algorithms and many techniques have been devised to heuristically speed up Dijkstra’s algorithm. One of these tech...

On the Automatic Generation of Route Bus Timetables According to the Classi cation of Destinations

Route bus system is fundamental transportation device for aged people, and have important role in every province. However passengers decreases year by year. Therefore we have developed the shortest path searching system called “BUS-NET” to sustain the public transport. Here, generation of timetables is picked up. In general, it is considered as very simple problem, however the route bus system ...